Dialectical Proof Theory for Defeasible Argumentation with Defeasible Priorities (Preliminary Report)
نویسنده
چکیده
In this paper a dialectical proof theory is proposed for logical systems for defeasible argumentation that t a certain format. This format is the abstract theory developed by Dung, Kowalski and others. A main feature of the proof theory is that it also applies to systems in which reasoning about the standards for comparing arguments is possible. The proof theory could serve as thèlogical core' of protocols for dispute in multi-agent decision making processes.
منابع مشابه
Dialectical Explanations in Defeasible Argumentation
This work addresses the problem of providing explanation capabilities to an argumentation system. Explanation in defeasible argumentation is an important, and yet undeveloped field in the area. Therefore, we move in this direction by defining a concrete argument system with explanation facilities. We consider the structures that provide information on the warrant status of a literal. Our focus ...
متن کاملRelating Protocols For Dynamic Dispute With Logics For Defeasible Argumentation
This article investigates to what extent protocols for dynamic disputes, i.e., disputes in which the information base can vary at different stages, can be justified in terms of logics for defeasible argumentation. First a general framework is formulated for dialectical proof theories for such logics. Then this framework is adapted to serve as a framework for protocols for dynamic disputes, afte...
متن کاملArgument-Based Extended Logic Programming with Defeasible Priorities
Inspired by legal reasoning, this paper presents a semantics and proof theory of a system for defeasible argumentation. Arguments are expressed in a logic-programming language with both weak and strong negation. Connicts between arguments are decided with the help of priorities on the rules. An important feature of the system is that these priorities are not xed, but are themselves defeasibly d...
متن کاملDefeasible Logic with Dynamic Priorities
Defeasible logic is a nonmonotonic reasoning approach based on rules and priorities. Its design supports efficient implementation, and it shows promise to be successfully deployed in applications. So far only static priorities have been used, provided by an external superiority relation. In this paper we show how dynamic priorities can be integrated, where priority information is obtained from ...
متن کاملArgumentation, Dialogue, and Decision Making 5.3 On Complexity of DeLP through Game Semantics On the Complexity of DeLP through Game Semantics
Defeasible Logic Programming (DeLP) is a general argumentation based system for knowledge representation and reasoning. Its proof theory is based on a dialectical analysis where arguments for and against a literal interact in order to determine whether this literal is believed by a reasoning agent. The semantics GS is a declarative trivalued game-based semantics for DeLP that is sound and compl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997